A New Distributed QoS Routing Algorithm using Mean Field Approximation Method
نویسندگان
چکیده
منابع مشابه
Distributed QoS Routing Using Bounded Flooding
Quality-of-Service (QoS) routing is indispensable to real-time applications in integrated services packet-switching networks. However, existing QoS-routing schemes based on either request ooding or link-state dissemination are ineecient in terms of message overhead and/or operational cost. This paper proposes a QoS-routing algorithm with bounded ooding which not only dramatically reduces messag...
متن کاملAn Efficient Distributed QoS-based Multicast Routing Algorithm
This paper proposes an eflcient distributed multicast routing algorithm that provides quality of service (QoS) guarantees for real-time applications. It focuses on the delay-constrained minimum cost tree (or constrained Steiner tree) problem; that is, it constructs a multicast tree that not only meets the constrained end-to-end delay requirements but also is the minimum cost multicast tree. Thi...
متن کاملMulticast Distributed Routing Algorithm for Providing Network QoS
Multicast Routing is widely used by various media applications (teleconference, distance learning...). The combination of multicast routing and Quality of Service (QoS) characteristics helps handling the technical requirements and brings better services to end-users. This paper proposes an extension of Distributed Routing Algorithm (DRA) for supporting multicast routing. The proposed algorithm ...
متن کاملA Multiconstraint Qos Routing Scheme Using a Modified Dijkstra’s Algorithm
Multiconstraint QoS (quality of service) routing is an essential mechanism to support computer/communication applications that have requirements on various QoS attributes. The multiconstraint QoS routing problem involves finding a feasible path, i.e., a path satisfying a given set of QoS constraints between given source and destination nodes. Unfortunately, the multiconstraint QoS routing probl...
متن کاملMicrocanonical Mean Field Annealing: A New Algorithm for Increasing the Convergence Speed of Mean Field Annealing
In this paper, we consider the convergence speed of mean field annealing (MFA). We combine MFA with microcanonical simulation(MCS) method and propose a new algorithm called microcanonical mean field annealing(MCMFA). In the proposed algorithm, cooling speed is controlled by current temperature so that computation in the MFA can be reduced without degradation of performance. In addition, the sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 2007
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss.127.59